A Weighted l1-Minimization for Distributed Compressive Sensing
نویسنده
چکیده
Distributed Compressive Sensing (DCS) studies the recovery of jointly sparse signals. Compared to separate recovery, the joint recovery algorithms in DCS are usually more effective as they make use of the joint sparsity. In this thesis, we study a weighted l1-minimization algorithm for the joint sparsity model JSM-1 proposed by Baron et al. Our analysis gives a sufficient null space property for the joint sparse recovery. Furthermore, this property can be extended to stable and robust settings. We also presents some numerical experiments for this algorithm.
منابع مشابه
Enhancing Sparsity by Reweighted l1 Minimization
It is now well understood that (1) it is possible to reconstruct sparse signals exactly from what appear to be highly incomplete sets of linear measurements and (2) that this can be done by constrained l1 minimization. In this paper, we study a novel method for sparse signal recovery that in many situations outperforms l1 minimization in the sense that substantially fewer measurements are neede...
متن کاملComputational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing
We study the computational properties of solving a constrained L1-L2 minimization via a difference of convex algorithm (DCA), which was proposed in our previous work [13, 19] to recover sparse signals from a under-determined linear system. We prove that the DCA converges to a stationary point of the nonconvex L1-L2 model. We clarify the relationship of DCA to a convex method, Bregman iteration ...
متن کاملA new result of the scaling law of weighted L1 minimization
Abstract—This paper study recovery conditions of weighted l1 minimization for signal reconstruction from compressed sensing measurements. A sufficient condition for exact recovery by using the general weighted l1 minimization is derived, which builds a direct relationship between the weights and the recoverability. Simulation results indicates that this sufficient condition provides a precise p...
متن کاملExact Recovery for Sparse Signal via Weighted l_1 Minimization
Numerical experiments in literature on compressed sensing have indicated that the reweighted l1 minimization performs exceptionally well in recovering sparse signal. In this paper, we develop exact recovery conditions and algorithm for sparse signal via weighted l1 minimization from the insight of the classical NSP (null space property) and RIC (restricted isometry constant) bound. We first int...
متن کاملA L1-Minimization for Image Reconstruction from Compressed Sensing
We proposed a simple and efficient iteratively reweighted algorithm to improve the recovery performance for image reconstruction from compressive sensing (CS). The numerical experiential results demonstrate that the new proposed method outperforms in image quality and computation complexity, compared with standard l1-minimization and other iteratively reweighted l1-algorithms when applying for ...
متن کامل